Lower Complexity Bounds for Parametric Stochastic Itô Integration

نویسنده

  • Stefan Heinrich
چکیده

We study the complexity of pathwise approximation of parameter dependent stochastic Itô integration for Cr functions, with r ∈ R, r > 0. Both definite and indefinite integration are considered. This complements previous results [2] for classes of functions with dominating mixed smoothness. Upper bounds are obtained by embedding of function classes and applying some generalizations of these previous results. The emphasis of the present paper lies on lower bounds. While in [2] only nonadaptive deterministic algorithms were considered, we prove here lower bounds for adaptive deterministic and randomized algorithms, both for the classes considered here as for those from [2].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stein approximation for Itô and Skorohod integrals by Edgeworth type expansions

We derive Edgeworth-type expansions for Skorohod and Itô integrals with respect to Brownian motion, based on cumulant operators defined by the Malliavin calculus. As a consequence we obtain Stein approximation bounds for stochastic integrals, which apply to SDE solutions and to multiple stochastic integrals.

متن کامل

Conditional Stein approximation for Itô and Skorohod integrals

We derive conditional Edgeworth-type expansions for Skorohod and Itô integrals with respect to Brownian motion, based on cumulant operators defined by the Malliavin calculus. As a consequence we obtain conditional Stein approximation bounds for multiple stochastic integrals and quadratic Brownian functionals.

متن کامل

Complexity of Banach space valued and parametric integration

We study the complexity of Banach space valued integration. The input data are assumed to be r-smooth. We consider both definite and indefinite integration and analyse the deterministic and the randomized setting. We develop algorithms, estimate their error, and prove lower bounds. In the randomized setting the optimal convergence rate turns out to be related to the geometry of the underlying B...

متن کامل

Complexity of parametric initial value problems in Banach spaces

We consider initial value problems for parameter dependent ordinary differential equations with values in a Banach space and study their complexity both in the deterministic and randomized setting, for input data from various smoothness classes. We develop multilevel algorithms, investigate the convergence of their deterministic and stochastic versions, and prove lower bounds.

متن کامل

Complexity of Banach space valued and parametric stochastic Itô integration

We present a complexity analysis for strong approximation of Banach space valued and parameter dependent scalar stochastic Itô integration, driven by a Wiener process. Both definite and indefinite integration are considered. We analyze the Banach space valued version of the EulerMaruyama scheme. Based on these results, we define a multilevel algorithm for the parameter dependent stochastic inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017